Characterizing the hierarchical Hough transform through a polygonal approximation algorithm

We propose to study the relationship between the hierachical Hough transform and classical algorithms for partitioning curves into segments. We show that the set of segments found by classical algorithms is a subset of the segments found by the hierarchical Hough transform. This new relationship allows to have a better understanding of the behaviour of some parameters of the hierarchical Hough transform.